Percolation in the signal to interference ratio graph
نویسندگان
چکیده
منابع مشابه
Percolation in the Signal to Interference Ratio Graph
Continuum percolation models in which pairs of points of a two-dimensional Poisson point process are connected if they are within some range of each other have been extensively studied. This paper considers a variation in which a connection between two points depends not only on their Euclidean distance, but also on the positions of all other points of the point process. This model has been rec...
متن کاملPercolation on the Information-Theoretically Secure Signal to Interference Ratio Graph
We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes (PPPs) in R2 of intensities λ and λE respectively. A directed edge from one legitimate node A to another legitimate node B exists provided the strength of the signal transmitted from node A that is received at node B i...
متن کاملSignal to Interference and Noise Ratio of an IR system
Infrared (IR), a new medium for indoor wireless communication system due to its abundant bandwidth that is virtually untapped and freely available, is become more and more popular in indoor wireless communication systems. Based on Direct Sequence Code Division Multiple Access (DS/CDMA) technique, infrared systems will use low power on transmission and reception by spreading spectrum which could...
متن کاملMaximum Signal Minus Interference to Noise Ratio Multiuser Receive Beamforming
Motivated by massive deployment of low data rate Internet of things (IoT) and ehealth devices with requirement for highly reliable communications, this paper proposes receive beamforming techniques for the uplink of a single-input multiple-output (SIMO) multiple access channel (MAC), based on a per-user probability of error metric and one-dimensional signalling. Although beamforming by directly...
متن کاملInterference percolation
Let G be an infinite connected graph with minimum degree δ and maximum degree ∆. Let Gp be a random induced subgraph of G obtained by selecting each vertex of G independently with probability p, 0 < p < 1, and let G≤k p be the induced subgraph of Gp obtained by deleting all vertices of Gp with degree greater than k in Gp. We show that if δ ≥ 6 and ∆/δ is not too large then G≤3 p almost surely h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2006
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200001820